An Alternative to Model Checking: Verification by Random Search of AND-OR Graphs Representing Finite-State Models
نویسندگان
چکیده
ABSTRACT In the development of high-assurance systems, formal modeling, analysis and verification techniques are playing an increasingly important role. In spite of significant advances, formal modeling and verification still suffers from limited applicability due to exponential runtime space growth exibited by model checkers. In this paper, we describe an alternative to model checking. We describe an algorithm that automatically translates Finite State Machine models used by model checkers into AND-OR graphs. State space verification of AND-OR graphs does not suffer from state space explosion, but its exhaustive search is an NP complete problem. Hence, we demonstrate that random searches of AND-OR graphs are a vaible alternative to model checking, suitable for system debugging and fast analysis during system development. We support our conclusions through the studies of two models, Dekker’s two process mutual exclusion algorithm and the Space Shuttle’s liquid hydrogen subsystem.In the development of high-assurance systems, formal modeling, analysis and verification techniques are playing an increasingly important role. In spite of significant advances, formal modeling and verification still suffers from limited applicability due to exponential runtime space growth exibited by model checkers. In this paper, we describe an alternative to model checking. We describe an algorithm that automatically translates Finite State Machine models used by model checkers into AND-OR graphs. State space verification of AND-OR graphs does not suffer from state space explosion, but its exhaustive search is an NP complete problem. Hence, we demonstrate that random searches of AND-OR graphs are a vaible alternative to model checking, suitable for system debugging and fast analysis during system development. We support our conclusions through the studies of two models, Dekker’s two process mutual exclusion algorithm and the Space Shuttle’s liquid hydrogen subsystem.
منابع مشابه
Random Search of AND-OR Graphs Representing Finite-State Models
Random Search of AND-OR Graphs Representing Finite-State Models David R. Owen Model checking tools have been effective in testing concurrent software represented by communicating finite-state machines. But these tools may require a very large amount of memory. A finite-state model can be translated automatically into a compact AND-OR graph. We use an abductive random search scheme to extract, f...
متن کاملReachability checking in complex and concurrent software systems using intelligent search methods
Software system verification is an efficient technique for ensuring the correctness of a software product, especially in safety-critical systems in which a small bug may have disastrous consequences. The goal of software verification is to ensure that the product fulfills the requirements. Studies show that the cost of finding and fixing errors in design time is less than finding and fixing the...
متن کاملOn the Advantages of Approximate vs. Complete Verification: Bigger Models, Faster, Less Memory, Usually Accurate
As software grows increasingly complex, verification becomes more and more challenging. Automatic verification by model checking has been effective in many domains including computer hardware design, networking, security and telecommunications protocols, automated control systems and others [2, 4, 6]. Many realworld software models, however, are too large for the available tools. The difficulty...
متن کاملA Hybrid Meta-heuristic Approach to Cope with State Space Explosion in Model Checking Technique for Deadlock Freeness
Model checking is an automatic technique for software verification through which all reachable states are generated from an initial state to finding errors and desirable patterns. In the model checking approach, the behavior and structure of system should be modeled. Graph transformation system is a graphical formal modeling language to specify and model the system. However, modeling of large s...
متن کاملA Transformation-Based Approach to Implication of GSTE Assertion Graphs
Generalized symbolic trajectory evaluation (GSTE) is a model checking approach and has successfully demonstrated its powerful capacity in formal verification of VLSI systems. GSTE is an extension of symbolic trajectory evaluation (STE) to themodel checking of ω-regular properties. It is an alternative to classical model checking algorithms where properties are specified as finite-state automata...
متن کامل